Alley CATs in search of good homes

A score sequence of a tournament is a monotonically non-decreasing sequence of the out-degrees of its vertices. We develop two algorithms that generates all score sequences, each of which appears to use only a constant amount of computation per sequence produced. A degree sequence of a graph is a monotonically non-increasing sequence of the degrees of its vertices. We develop an algorithm that generates all degree sequences of given length and observe that the algorithm does only constant computation per sequence produced. This algorithm is extended to generate degree sequences of connected graphs, and of biconnected graphs.